Markdown Optimization via Approximate Dynamic Programming

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization-based Approximate Dynamic Programming

OPTIMIZATION-BASED APPROXIMATE DYNAMIC PROGRAMMING

متن کامل

Approximate Dynamic Programming via Linear Programming

The curse of dimensionality gives rise to prohibitive computational requirements that render infeasible the exact solution of largescale stochastic control problems. We study an efficient method based on linear programming for approximating solutions to such problems. The approach "fits" a linear combination of preselected basis functions to the dynamic programming costtogo function. We develop...

متن کامل

Approximate Dynamic Programming via Iterated Bellman Inequalities

In this paper we introduce new methods for finding functions that lower bound the value function of a stochastic control problem, using an iterated form of the Bellman inequality. Our method is based on solving linear or semidefinite programs, and produces both a bound on the optimal objective, as well as a suboptimal policy that appears to works very well. These results extend and improve boun...

متن کامل

Dynamic Programming via Convex Optimization

It has long been known that a wide class of problems in optimal control can be stated as infinite-dimensional convex optimization problems, where the Bellman equation is relaxed to inequality. In this paper we continue our recent efforts to show how this formulation can be used for numerical computation of optimal cost functions and control laws. In particular, we discuss new forms of discretiz...

متن کامل

Numerical Shape Optimization via Dynamic Programming

In this paper we describe a novel framework for finding numerical solutions to a wide range of shape optimization problems. It is based on classical dynamic programming approach augmented with discretization of the space of trajectories and controls. This allows for straightforward algorithmic implementation. This method has been used to solve a well known problem called the ”dividing tube prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Computational Intelligence Systems

سال: 2013

ISSN: 1875-6891,1875-6883

DOI: 10.1080/18756891.2013.754181